Description: 用模拟退火技术解决旅行商问题.算法中采用了人工智能中比较新的模拟退火算法.-simulated annealing technology to solve the traveling salesman problem. Algorithms used in the artificial intelligence relatively new simulated annealing algorithm. Platform: |
Size: 101439 |
Author:刘先生 |
Hits:
Description: 用模拟退火算法求解旅行商问题，其中用STL中的Vector来实现路径的存放 -simulated annealing algorithm for the traveling salesman problem, which use the STL Vector to achieve the storage path Platform: |
Size: 118354 |
Author:田园 |
Hits:
Description: 10。《用于最优化的计算智能》，Nirwan Ansali，Edwin Hou着，李军，边肇棋译 清华大学出版社 1999年第一版
本书从讨论组合优化中的基本问题——NP问题入手，系统地讲述了近年来所发展起来的智能最优化的各种技术和方法，其中包括启发式搜索、Hopfield神经网络、模拟退火和随机机、均场退火以及遗传算法等；并在此基础上，通过一些典型的应用问题，如旅行商问题、模式识别中的点模式匹配问题、通信和任务调度等问题进一步阐明以上一些基本方法怎样用来解决这些原来具有NP性质的困难问题。本书是作者在美国新泽西州理工学院多年讲授有关课程的基础上写成的。全书深入浅出，理论联系实际。为帮助学生掌握基本概念，提高学习能动性，各章编写了习题。本书可作为通信、计算机、控制各专业的高年级学生和研究生学习有关课程的教材。它对于广大科研工作者也是一本很有实际价值的参考书。 -10. "Optimal for Computational Intelligence," Nirwan Ansali, with Edwin Hou, Li Jun, Pin Zhaoxing chess translation Tsinghua University Press in 1999 the first book version of combinatorial optimization from the discussion of basic questions -- NP problem start, the system described in recent years to develop the intelligent optimization of the technology and methods, These include heuristic search, Hopfield networks, simulated annealing and random machine, mean field annealing and genetic algorithms; and on this basis and through some typical applications, such as the traveling salesman problem, pattern recognition of point pattern matching, communication and task scheduling and other issues to further clarify some of these basic methods how to solve these with the original natu Platform: |
Size: 2560416 |
Author:孙东 |
Hits:
Description: 经典的货郎担问题解决办法，采用了模拟退火算法，结构非常清楚，速度很快！-classic traveling salesman problem solution, using simulated annealing, the structure is very clear, very fast! Platform: |
Size: 1437975 |
Author:红红 |
Hits:
Description: 运用c＃语言实现模拟退火算法，同时利用该算法解决旅行商（TSP）问题，获得遍历所有城市序号的最优路径。-use c # language simulated annealing, while using the algorithm to solve traveling salesman (TSP). access to the serial numbers of all the cities traverse the optimal path. Platform: |
Size: 131403 |
Author:linvg |
Hits:
Description: 是一个模拟退火程序,解决的是货郎担问题,所用的语言是matlab
-is a simulated annealing procedures to solve the traveling salesman problem is that the language used is Matlab Platform: |
Size: 5760 |
Author:成应 |
Hits:
Description: 这是一个SA求解tsp旅行商的matlab源代码，由m文件构成，可方便大家学习模拟退火算法。-This is a traveling salesman tsp SA for the Matlab source code, document constitute m, can facilitate learning simulated annealing. Platform: |
Size: 6053 |
Author:郑立刚 |
Hits:
Description: 98年全国大学生数学建模竞赛B题“水灾巡视问题”，是一个推销员问题，本题有53个点，所有可能性大约为exp(53),目前没有好方法求出精确解，既然求不出精确解，我们使用模拟退火法求出一个较优解,将所有结点编号为1到53,1到53的排列就是系统的结构,结构的变化规则是:从1到53的排列中随机选取一个子排列,将其反转或将其移至另一处,能量E自然是路径总长度。具体算法描述如下：步1： 设定初始温度T，给定一个初始的巡视路线。步2 ：步3 --8循环K次步3：步 4--7循环M次步4：随机选择路线的一段步5：随机确定将选定的路线反转或移动，即两种调整方式：反转、移动。步6：计算代价D，即调整前后的总路程的长度之差步7：按照如下规则确定是否做调整：如果D<0,则调整如果D>0,则按照EXP(-D/T)的概率进行调整步8:T*0.9-->T,降温-98 National Mathematical Contest in Modeling B and that the "flood inspections", is a salesman problem, and that is 53 points, all possibilities about exp (53), there is no good way to get accurate solutions, since no exact solution for, we used simulated annealing France obtained an optimum solution to all nodes to a number of 53 to 53.1 is with the system structure, changes in the structure of the rules is : from 1-53 with a randomly selected with a son, to reverse or to move it to another, the energy E is the natural path length. The specific algorithm is described as follows : Step 1 : The initial set temperature T, given an initial inspection line. Step 2 : Step 3 -- 8 K cycle times Step 3 : Step 4 -- 7 M cycle times Step 4 : The random selection of routes for Step 5 : rando Platform: |
Size: 2827 |
Author:王冠 |
Hits:
Description: 旅行商问题研究，对初学者对禁忌搜索，蚁群算法，和模拟退火有很大帮助。-Traveling Salesman Problem, for beginners tabu search, ant colony algorithm, and simulated annealing of great help. Platform: |
Size: 754688 |
Author:刘同学 |
Hits:
Description: 包含模拟退火在旅行商问题，最大截问题，独立集问题和图着色问题的程序-Simulated Annealing included in the traveling salesman problem, the maximum cut problem, independent set problems and coloring program Platform: |
Size: 15360 |
Author:田兵 |
Hits:
Description: 用模拟退火算法求解TSP问题，matlab程序，包含了程序所实现的论文
- TSP is studied by simulated annealing algorithm and an approximate algorithm which method for solving TSP is better than others ,and using Matlab,we complete the program for solving TSP. The simulation of
algorithm for travelling salesman problem is given ,and the results prove its efficiency. Platform: |
Size: 124928 |
Author:lxy |
Hits:
Description: 此段程序是用模拟退火思想解决旅行商TSP问题，有详细步骤说明。-This program solves the Traveling Salesman Problem(TSP) using an intelligent algorithm of the simulated annealing,which detail steps are explained. Platform: |
Size: 5828608 |
Author:xian |
Hits:
Search - salesman annealing